Pseudorandomness against Depth-2 Circuits and Analysis of Goldreich's Candidate One-Way Function
نویسنده
چکیده
Pseudorandomness against Depth-2 Circuits and Analysis of Goldreich’s Candidate One-Way Function
منابع مشابه
0 ◦ MOD 2 Lower Bounds for the Boolean Inner Product ∗
AC0 ◦MOD2 circuits are AC0 circuits augmented with a layer of parity gates just above the input layer. We study AC0 ◦MOD2 circuit lower bounds for computing the Boolean Inner Product functions. Recent works by Servedio and Viola (ECCC TR12-144) and Akavia et al. (ITCS 2014) have highlighted this problem as a frontier problem in circuit complexity that arose both as a first step towards solving ...
متن کاملMonotone Circuits: One-Way Functions versus Pseudorandom Generators
We study the computability of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions that are computable by (uniform) polynomial-size monotone functions, provided (of course) that one-way functions exist at all. On the other hand, no monotone function can be a pseudorandom generator.
متن کاملConspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness
We prove several results giving new and stronger connections between learning theory, circuit complexity and pseudorandomness. Let C be any typical class of Boolean circuits, and C[s(n)] denote n-variable C-circuits of size ≤ s(n). We show: Learning Speedups. If C[poly(n)] admits a randomized weak learning algorithm under the uniform distribution with membership queries that runs in time 2/n, t...
متن کاملBootstrapping variables in algebraic circuits
We show that for the blackbox polynomial identity testing (PIT) problem it suffices to study circuits that depend only on the first extremely few variables. One only need to consider size-s degree-s circuits that depend on the first log◦c s variables (where c is a constant and we are composing c logarithms). Thus, hitting-set generator (hsg) manifests a bootstrapping behavior— a partial hsg aga...
متن کاملOn the Complexity of Parallel Hardness Amplification for One-Way Functions
We prove complexity lower bounds for the tasks of hardness amplification of one-way functions and construction of pseudo-random generators from one-way functions, which are realized non-adaptively in black-box ways. First, we consider the task of converting a one-way function f : {0, 1} → {0, 1} into a harder one-way function f̄ : {0, 1} → {0, 1}, with n̄, m̄ ≤ poly(n), in a black-box way. The har...
متن کامل